Average search time bounds in cue-based searches

In this work we consider search problems that evaluate the probability distribution of finding source at each step in search. We start with a sample strategy where movement time is immediate neighborhood. The jump taken to be proportional normalized difference between location present location. lower bound on average for searcher using strategy. next problem evaluating generic which would utilize figure out position source. derive an expression time. analytic case particles emitted by diffuse homogeneous manner. For general entropy $E$, find goes as ${e}^{E/2}$.